Alpha - Beta - Conspiracy Search ( Draft of Oct
نویسندگان
چکیده
We introduce a variant of-search in which each node is associated with two depths rather than one. The purpose of-search is to nd strategies for each player that together establish a value for the root position. A max strategy establishes a lower bound and the min strategy establishes an upper bound. It has long been observed that forced moves should be searched more deeply. Here we make the observation that in the max strategy we are only concerned with the forcedness of max moves and in the min strategy we are only concerned with the forcedness of min moves. This leads to two measures of depth | one for each strategy | and to a two depth variant of-called ABC search. The two depth approach can be formally derived from conspiracy theory and the structure of the ABC procedure is justiied by two theorems relating ABC search and conspiracy numbers.
منابع مشابه
Alpha - Beta - Conspiracy Search ( Draft of Oct . 20 , 1993 )
We introduce a variant of-search in which each node is associated with two depths rather than one. The purpose of-search is to nd strategies for each player that together establish a value for the root position. A max strategy establishes a lower bound and the min strategy establishes an upper bound. It has long been observed that forced moves should be searched more deeply. Here we make the ob...
متن کاملConspiracy number search with relative sibling scores
For some two-player games (e.g. Go), no accurate and inexpensive heuristic is known for evaluating leaves of a search tree. For other games (e.g. chess), a heuristic is known (sum of piece values). For other games (e.g. Hex), only a local heuristic — one that compares children reliably, but non-siblings poorly — is known (cell voltage drop in the Shannon/Anshelevich electric circuit model). In ...
متن کاملSibling Conspiracy Number Search
For some two-player games (e.g. Go), no accurate and inexpensive heuristic is known for evaluating leaves of a search tree. For other games (e.g. chess), a heuristic is known (sum of piece values). For other games (e.g. Hex), only a local heuristic — one that compares children reliably, but nonsiblings poorly — is known (cell voltage drop in the Shannon/Anshelevich electric circuit model). In t...
متن کاملModern developments of Shannon’s Chess
We investigate some improvements and recent developments in the game-tree search techniques, which have influenced development of modern computer chess programs. We shall present an overview of various search heuristics to the basic Alpha-Beta (AB) pruning algorithm in order to achieve good move ordering (Iterative Deepening, Killer Heuristic, History Heuristic, Transposition Tables and Aspirat...
متن کاملCross-sectional anatomic configurations of peripapillary atrophy evaluated with spectral domain-optical coherence tomography.
PURPOSE To evaluate the cross-sectional configurations of peripapillary atrophy (PPA)-alpha and -beta in ophthalmologically normal subjects using spectral domain-optical coherence tomography (SD-OCT). METHODS One hundred twenty normal subjects had a complete ophthalmic examination including axial length measurement, standard automated perimetry, fundus imaging with photography, and SD-OCT (3D...
متن کامل